The Modal Logic of Inequality

نویسنده

  • Maarten de Rijke
چکیده

We consider some modal languages with a modal operator D whose semantics is based on the relation of inequality. Basic logical properties such as definability, expressive power and completeness are studied. Also, some connections with a number of other recent proposals to extend the standard modal language are pointed at. ?

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Suhrawardi's Modal Syllogisms

Suhrawardi’s logic of the Hikmat al-Ishraq is basically modal. So to understand his modal logic one first has to know the non-modal part upon which his modal logic is built. In my previous paper ‘Suhrawardi on Syllogisms’(3) I discussed the former in detail. The present paper is an exposition of his treatment of modal syllogisms. On the basis of some reasonable existential presuppositi...

متن کامل

Inequality without irre exivity

This paper presents the axiomatization | without the rule of irreeex-ivity | of the modal logic of inequality as well as a method for proving its completeness. This method uses the technics of the frame of subordi-nation.

متن کامل

Fibring Modal First-Order Logics: Completeness Preservation

Fibring is defined as a mechanism for combining logics with a firstorder base, at both the semantic and deductive levels. A completeness theorem is established for a wide class of such logics, using a variation of the Henkin method that takes advantage of the presence of equality and inequality in the logic. As a corollary, completeness is shown to be preserved when fibring logics in that class...

متن کامل

Solving Graded/Probabilistic Modal Logic via Linear Inequalities (System Description)

We present the experience gained from implementing a new decision procedure for both graded and probabilistic modal logic. While our approach uses standard tableaux for propositional connectives, modal rules are given by linear constraints on the arguments of operators. The implementation uses binary decision diagrams for propositional connectives and a linear programming library for the modal ...

متن کامل

On Modal Logics of Linear Inequalities

We consider probabilistic modal logic, graded modal logic and stochastic modal logic, where linear inequalities may be used to express numerical constraints between quantities. For each of the logics, we construct a cut-free sequent calculus and show soundness with respect to a natural class of models. The completeness of the associated sequent calculi is then established with the help of coalg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Symb. Log.

دوره 57  شماره 

صفحات  -

تاریخ انتشار 1992